All Questions
Tagged with time-complexitysearch
2 questions
0votes
1answer
991views
What does the branching factor mean in the time complexity of Breadth-First Search (BFS)
Can someone explain where my math is off here? I am confused on the b - Branching Factor and how to calculate the worst-case scenario when running BFS. In a worst-case scenario BFS would have to hit ...
3votes
2answers
6kviews
Why is the space-complexity of greedy best-first search is $\mathcal{O}(b^m)$?
I am reading through Artificial Intelligence: Modern Approach and it states that the space complexity of the GBFS (tree version) is $\mathcal{O}(b^m)$. While I am reading, at some points, I found ...
